منابع مشابه
On Combinatorial Depth Measures
Given a set P = {p1, . . . , pn} of points and a point q in the plane, we define a function ψ(q) that provides a combinatorial characterization of the multiset of values {|P ∩Hi|}, where for each i ∈ {1, . . . , n}, Hi is the open half-plane determined by q and pi. We introduce two new natural measures of depth, perihedral depth and eutomic depth, and we show how to express these and the well-k...
متن کاملOn the Depth of Combinatorial Optimization Problems
This paper studies the notion of “depth” of a combinatorial optimization problem, which has already been touched on by several other authors (cf. Weber or Hajek). This notion can be defined as follows: Consider a discrete optimization problem min{r(.u) 1 x E x). Usually hill climbing algorithms work as follows: First, a neighbourhood structure has to be specified on X. Then, starting from an ar...
متن کاملMonitoring Depth of Anesthesia by Nonlinear Correlation Measures
Background: Monitoring the depth of anesthesia (DOA) takes an important role for anesthetists in order avoiding undesirable reactions such as intraoperative awareness, prolonged recovery and increased risk of postoperative complications.The Central Nervous System (CNS) is the main target of anesthetic drugs, hence EEG signal processing during anesthesia is helpful for monitoring DOA. In order t...
متن کاملGeometric measures of data depth
Several measures of data depth have been proposed, each attempting to maintain certain robustness properties. This paper lists the main approaches known to the computer science community. Properties and algorithms are mentioned, for computing the depth of a point and the location of
متن کاملA combinatorial approach to colourful simplicial depth
The colourful simplicial depth conjecture states that any point in the convex hull of each of d+1 sets, or colours, of d+1 points in general position inRd is contained in at least d 2 +1 simplices with one vertex from each set. We verify the conjecture in dimension 4 and strengthen the known lower bounds in higher dimensions. These results are obtained using a combinatorial generalization of co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2018
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195918500127